package com.leetcode.dfs;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

public class Candidates {
    public List<List<Integer>> combinationSum2(int[] candidates, int target) {
        List<List<Integer>> res = new ArrayList<>();
        // 对candidates进行排序
        Arrays.sort(candidates);
        for (int candidate : candidates) {
            List<Integer> item = new ArrayList<>();
            if (candidate > target) {
                continue;
            } else if (candidate == target) {
                item.add(candidate);

            }
        }
        return res;
    }
}
